Efficient Visual Search: A Connectionist Solution

نویسندگان

  • Subutai Ahmad
  • Stephen Omohundro
چکیده

Searching for objects in scenes is a natural task for people and has been extensively studied by psychologists. In this paper we examine this task from a connectionist perspective. Computational complexity arguments suggest that parallel feed-forward networks cannot perform this task efficiently. One difficulty is that, in order to distinguish the target from distractors, a combination of features must be associated with a single object. Often called the binding problem, this requirement presents a serious hurdle for connectionist models of visual processing when multiple objects are present. Psychophysical experiments suggest that people use covert visual attention to get around this problem. In this paper we describe a psychologically plausible system which uses a focus of attention mechanism to locate target objects. A strategy that combines top-down and bottom-up information is used to minimize search time. The behavior of the resulting system matches the reaction time behavior of people in several interesting tasks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

0 Efficient Visual Search : A Connectionist Solution 1

Searching for objects in scenes is a natural task for people and has been extensively studied by psychologists. In this paper we examine this task from a connectionist perspective. Computational complexity arguments suggest that parallel feed-forward networks cannot perform this task efficiently. One difficulty is that, in order to distinguish the target from distractors, a combination of featu...

متن کامل

Equilateral Triangles: A Challenge for Connectionist Vision

In this paper we explore the problem of dynamically computing visual relations in a connectionist system. The task. of detecting equilateral triangles from clusters of points is used to test our architecture. We argue that this is a difficult task for traditional feed-forward architectures although it is a simple task for people. Our solution implements a biologically inspired networlc which us...

متن کامل

A Heuristic Algorithm for Nonlinear Lexicography Goal Programming with an Efficient Initial Solution

In this paper,  a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis...

متن کامل

Improving Energy-Efficient Target Coverage in Visual Sensor Networks

Target coverage is one of the important problems in visual sensor networks. The coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. In this paper, we address the maximum lifetime for visual sensor networks (MLV) problem by maximizing the network lifetime while covering all the targets. For this purpose, we develop a simulated annealing (SA) ...

متن کامل

Localist Approach to Natural Language Processing

Determining the meaning of a sentence in a natural language requires an efficient search mechanism to find the corresponding point in a very large space of sentence meanings. Examination of large search spaces must rely on constraints to guide the search process and provide satisfactory performance. However, existing knowledge representation techniques used in AI, both classical and connectioni...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991